全文获取类型
收费全文 | 5371篇 |
免费 | 433篇 |
国内免费 | 376篇 |
专业分类
化学 | 227篇 |
晶体学 | 3篇 |
力学 | 58篇 |
综合类 | 154篇 |
数学 | 5456篇 |
物理学 | 282篇 |
出版年
2024年 | 10篇 |
2023年 | 100篇 |
2022年 | 142篇 |
2021年 | 127篇 |
2020年 | 202篇 |
2019年 | 235篇 |
2018年 | 224篇 |
2017年 | 208篇 |
2016年 | 134篇 |
2015年 | 100篇 |
2014年 | 184篇 |
2013年 | 463篇 |
2012年 | 205篇 |
2011年 | 302篇 |
2010年 | 311篇 |
2009年 | 461篇 |
2008年 | 404篇 |
2007年 | 290篇 |
2006年 | 347篇 |
2005年 | 234篇 |
2004年 | 209篇 |
2003年 | 190篇 |
2002年 | 175篇 |
2001年 | 161篇 |
2000年 | 116篇 |
1999年 | 111篇 |
1998年 | 101篇 |
1997年 | 74篇 |
1996年 | 54篇 |
1995年 | 62篇 |
1994年 | 47篇 |
1993年 | 32篇 |
1992年 | 28篇 |
1991年 | 16篇 |
1990年 | 14篇 |
1989年 | 15篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1959年 | 1篇 |
排序方式: 共有6180条查询结果,搜索用时 31 毫秒
41.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献
42.
In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph). Moreover, we investigate the determination of the orders of the elements of a finite group from its directed (resp. undirected) reduced power graph. Consequently, we show that some classes of finite groups are recognizable from their undirected reduced power graphs. Also, we study the relationship between the isomorphism classes of groups corresponding to the equivalence relations induced by the isomorphism of each of these graphs on the set of all finite groups. 相似文献
43.
In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that does not converge as (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices ). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture. 相似文献
44.
Ludwin A.BASILIO-HERNáNDEZ Walter CARBALLOSA Jesús LEA?OS José M.SIGARRETA 《数学学报(英文版)》2019,35(3):338-354
We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G. 相似文献
45.
《Discrete Mathematics》2019,342(12):111597
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by two independent vectors. We prove the optimality of the arrangements using techniques from rigidity theory and topological graph theory. 相似文献
46.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献
47.
Douglas R. Woodall 《Journal of Graph Theory》2019,92(4):488-490
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree is at least if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively. 相似文献
48.
Justin Z. Schroeder 《组合设计杂志》2019,27(1):42-52
We provide two new constructions for pairs of mutually orthogonal symmetric hamiltonian double Latin squares. The first is a tripling construction, and the second is derived from known constructions of hamilton cycle decompositions of when is prime. 相似文献
49.
Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of Kn,n. 相似文献